On the Linear Syzygies Of

نویسندگان

  • V. REINER
  • V. WELKER
چکیده

We give an elementary description of the maps in the linear strand of the minimal free resolution of a square-free monomial ideal, that is, the Stanley-Reisner ideal associated to a simplicial complex. The description is in terms of the homology of the canonical Alexander dual complex. As applications we are able to prove for monomial ideals and j = 1 a conjecture of J. Herzog giving lower bounds on the number of i-syzygies in the linear strand of j th-syzygy modules. show that the maps in the linear strand can be written using only 1 coee-cients if is a pseudomanifold, exhibit an example where multigraded maps in the linear strand cannot be written using only 1 coeecients. compute the entire resolution explicitly when is the complex of independent sets of a matroid. 1. Introduction The goal of this paper is to describe in a simple topological fashion the maps in the linear strand of the minimal free resolution of a Stanley-Reisner ideal. It is an outgrowth of two recent trends in the theory of minimal free resolutions. The rst is a series of results 1, 2, 4, 5, 7, 20] giving explicit descriptions of the maps in the minimal free resolutions for various classes of ideals. The second is the realization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IDEALS WITH (d1, . . . , dm)-LINEAR QUOTIENTS

In this paper, we introduce the class of ideals with $(d_1,ldots,d_m)$-linear quotients generalizing the class of ideals with linear quotients. Under suitable conditions we control the numerical invariants of a minimal free resolution of ideals with $(d_1,ldots,d_m)$-linear quotients. In particular we show that their first module of syzygies is a componentwise linear module.

متن کامل

Upper-bound of Reduction Operators and Computation of Syzygies

Several constructive methods in algebra are based on the computation of syzygies. For instance, a generating set of syzygies offers criteria to detect useless critical pairs during Buchberger’s algorithm, that is critical pairs whose corresponding S-polynomials reduces into zero [8]. Such criteria improve the complexity of Buchberger’s algorithm since most of the time is spent in computing into...

متن کامل

New evidence for Green’s conjecture on syzygies of canonical curves

Some twelve years ago, Mark Green [G] made a few conjectures regarding the behaviour of syzygies of a curve C imbedded in IP n by a complete linear system. The so-called generic Green conjecture on canonical curves pertains to this question when the linear system is the canonical one and the curve is generic in the moduli, and predicts what are the numbers of syzygies in that case. Green and La...

متن کامل

Geometry of Syzygies via Poncelet Varieties

We consider the Grassmannian Gr(k, n) of (k+1)-dimensional linear subspaces of Vn = H 0(P1,OP1(n)). We define Xk,r,d as the classifying space of the k-dimensional linear systems of degree n on P whose basis realize a fixed number of polynomial relations of fixed degree, say a fixed number of syzygies of a certain degree. The first result of this paper is the computation of the dimension of Xk,r...

متن کامل

On Syzygies of Projective

In this article, we give a criterion for an embedding of a projective variety to be deened by quadratic equations and for it to have linear syzygies. Our criterion is intrinsic in nature and implies that embedding corresponding to a suuciently high power of any ample line bundle will have linear syzygies up to a given order. Introduction. Let X be a projective variety. The conditions that guara...

متن کامل

Syzygies among reduction operators

We introduce the notion of syzygy for a set of reduction operators and relate it to the notion of syzygy for presentations of algebras. We give a method for constructing a linear basis of the space of syzygies for a set of reduction operators. We interpret these syzygies in terms of the confluence property from rewriting theory. This enables us to optimise the completion procedure for reduction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998